By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 20, Issue 3, pp. 545-810

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes

Klaus Jansen and Lorant Porkolab

pp. 545-563

BibTeX  Abstract Full Text:  PDF

Multicolored Parallelisms of Isomorphic Spanning Trees

S. Akbari, A. Alipour, H. L. Fu, and Y. H. Lo

pp. 564-567

BibTeX  Abstract Full Text:  PDF

Autocorrelations of Maximum Period FCSR Sequences

Hong Xu and Wen-Feng Qi

pp. 568-577

BibTeX  Abstract Full Text:  PDF

A Splitter Theorem for Internally 4-Connected Binary Matroids

Jim Geelen and Xiangqian Zhou

pp. 578-587

BibTeX  Abstract Full Text:  PDF

Matroid $T$-Connectivity

Jim Geelen, Bert Gerards, and Geoff Whittle

pp. 588-596

BibTeX  Abstract Full Text:  PDF

A Note on Quasi-triangulated Graphs

Ion Gorgos, Chính T. Hoàng, and Vitaly Voloshin

pp. 597-602

BibTeX  Abstract Full Text:  PDF

Cycle Decompositions of $K_{\lowercase{n,n}}-I$

Jun Ma, Liqun Pu, and Hao Shen

pp. 603-609

BibTeX  Abstract Full Text:  PDF

Shortest Paths in the Tower of Hanoi Graph and Finite Automata

Dan Romik

pp. 610-622

BibTeX  Abstract Full Text:  PDF

Dense Arrangements are Locally Very Dense. I

József Solymosi

pp. 623-627

BibTeX  Abstract Full Text:  PDF

Comparing Partial Rankings

Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, and Erik Vee

pp. 628-648

BibTeX  Abstract Full Text:  PDF

A Combinatorial Interpretation of the Chebyshev Polynomials

Emanuele Munarini

pp. 649-655

BibTeX  Abstract Full Text:  PDF

A New Periodicity Lemma

Kangmin Fan, Simon J. Puglisi, W. F. Smyth, and Andrew Turpin

pp. 656-668

BibTeX  Abstract Full Text:  PDF

Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes

Atif Abueida and R. Sritharan

pp. 669-681

BibTeX  Abstract Full Text:  PDF

Cycle Extendability of Hamiltonian Interval Graphs

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, and Michael S. Jacobson

pp. 682-689

BibTeX  Abstract Full Text:  PDF

The Channel Assignment Problem with Variable Weights

Daniel Král'

pp. 690-704

BibTeX  Abstract Full Text:  PDF

Compact Routing with Name Independence

Marta Arias, Lenore J. Cowen, Kofi A. Laing, Rajmohan Rajaraman, and Orjeta Taka

pp. 705-726

BibTeX  Abstract Full Text:  PDF

Reconstructing Chain Functions in Genetic Networks

Irit Gat-Viks, Richard M. Karp, Ron Shamir, and Roded Sharan

pp. 727-740

BibTeX  Abstract Full Text:  PDF

On the Strong Chromatic Number of Graphs

Maria Axenovich and Ryan Martin

pp. 741-747

BibTeX  Abstract Full Text:  PDF

Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems

Sofia Kovaleva and Frits C. R. Spieksma

pp. 748-768

BibTeX  Abstract Full Text:  PDF

The Complexity of Graph Pebbling

Kevin Milans and Bryan Clark

pp. 769-798

BibTeX  Abstract Full Text:  PDF

On Graphs Having No Chromatic Zeros in (1,2)

F. M. Dong and K. M. Koh

pp. 799-810

BibTeX  Abstract Full Text:  PDF